Welcome![Sign In][Sign Up]
Location:
Search - matching problem

Search list

[Other匈牙利算法

Description: 本文用C语言实现了优化算法-匈牙利算法,以用来解决匹配问题-Using C programming language, the optimization algorithm-Hungary algorithm used to solve the matching problem
Platform: | Size: 3613 | Author: 申辉 | Hits:

[Graph programharris.m

Description: 立体视觉的关键技术是解决对应问题,点特征常被用来做特征。HARRIS角点检测算子较有影响。用MATLAB编写的。-stereo vision technology is the key to solve the matching problem, point feature often used to do features. HARRIS corner detection operator more influential. MATLAB prepared.
Platform: | Size: 2360 | Author: jxhappyqin | Hits:

[Mathimatics-Numerical algorithmsstackapp

Description: 使用栈实现括弧配对问题-use Stack bracket matching problem
Platform: | Size: 48613 | Author: 吴月 | Hits:

[OS program逆波兰表达式

Description: 计算用运算符后缀法表示的表达式的值。后缀表达式也称逆波兰表达式,比中缀表达式计算起来更方便简单些,中缀表达式要计算就存在着括号的匹配问题,所以在计算表达式值时一般都是先转换成后缀表达式,再用后缀法计算表达式的值。如:表达式(a+b*c)/d-e用后缀法表示应为abc*+d/e-。只考虑四则算术运算,且假设输入的操作数均为1位十进制数(0—9),并且输入的后缀形式表达式不含语法错误-calculated Operators suffix France said the value of the expression. Suffix expression also called inverse Poland expression, which is made up of formulas can be more convenient for some simple, ordinary expression to calculate the brackets on the existence of the matching problem, in the calculation of expression values are generally first converted into a suffix expression, reuse suffix calculated the value of the expression. Such as : The expression (a, b * c) / d-e suffix method used to be said for abc * d/e-. Consider only four arithmetic operations and the operation of input assumptions are a few decimal (0-9), and enter the suffix-free form expression syntax errors
Platform: | Size: 1451 | Author: 刘一 | Hits:

[CSharptlparen

Description: « 问题描述:在对高级语言编写的程序进行编译时会遇到表达式或字符串的括号匹配问题。例如C++程序中左、右花括号“{”和“}”的匹配问题。表达式(字符串)的括号匹配问题要求确定一给定表达式(字符串)中左、右括号的匹配情况。例如,表达式(x*(x+y)-z)在位置1 和4处有左括号,在位置8 和11 处有右括号。位置1 处的左括号与位置11 处的右括号相匹配;位置4 处的左括号与位置8 处的右括号相匹配。而在表达式(x+y)*z)(中,位置8处的右括号没有可匹配的左括号,位置9处的左括号没有可匹配的右括号。« 编程任务:给定一个C++源程序,编程计算其中括号“<”和“>”;“(”和“)”;“[”和“]”;“{”和“}”的匹配情况-laquo; Problem description : In preparation for the high-level language compiler procedures that will be encountered expression or string matching brackets. C procedures such as left and right curly "(" and ")" matching problem. Expression (string), the brackets matching requirement to set a fixed expression (string) left and right brackets of the match. For example, the expression (x * (x y) - z) in a position and have left four brackets in position 8 and 11 have the right brackets. A position on the left with brackets of 11 positions in brackets right match; Location four brackets on the left and the location of eight brackets right match. The expression (x y) * z) (location eight brackets on the right side can not match left in brackets, location nine left in bracket
Platform: | Size: 1195 | Author: 林天 | Hits:

[OS program逆波兰表达式

Description: 计算用运算符后缀法表示的表达式的值。后缀表达式也称逆波兰表达式,比中缀表达式计算起来更方便简单些,中缀表达式要计算就存在着括号的匹配问题,所以在计算表达式值时一般都是先转换成后缀表达式,再用后缀法计算表达式的值。如:表达式(a+b*c)/d-e用后缀法表示应为abc*+d/e-。只考虑四则算术运算,且假设输入的操作数均为1位十进制数(0—9),并且输入的后缀形式表达式不含语法错误-calculated Operators suffix France said the value of the expression. Suffix expression also called inverse Poland expression, which is made up of formulas can be more convenient for some simple, ordinary expression to calculate the brackets on the existence of the matching problem, in the calculation of expression values are generally first converted into a suffix expression, reuse suffix calculated the value of the expression. Such as : The expression (a, b* c)/d-e suffix method used to be said for abc* d/e-. Consider only four arithmetic operations and the operation of input assumptions are a few decimal (0-9), and enter the suffix-free form expression syntax errors
Platform: | Size: 1024 | Author: 刘一 | Hits:

[CSharptlparen

Description: « 问题描述:在对高级语言编写的程序进行编译时会遇到表达式或字符串的括号匹配问题。例如C++程序中左、右花括号“{”和“}”的匹配问题。表达式(字符串)的括号匹配问题要求确定一给定表达式(字符串)中左、右括号的匹配情况。例如,表达式(x*(x+y)-z)在位置1 和4处有左括号,在位置8 和11 处有右括号。位置1 处的左括号与位置11 处的右括号相匹配;位置4 处的左括号与位置8 处的右括号相匹配。而在表达式(x+y)*z)(中,位置8处的右括号没有可匹配的左括号,位置9处的左括号没有可匹配的右括号。« 编程任务:给定一个C++源程序,编程计算其中括号“<”和“>”;“(”和“)”;“[”和“]”;“{”和“}”的匹配情况-laquo; Problem description : In preparation for the high-level language compiler procedures that will be encountered expression or string matching brackets. C procedures such as left and right curly "(" and ")" matching problem. Expression (string), the brackets matching requirement to set a fixed expression (string) left and right brackets of the match. For example, the expression (x* (x y)- z) in a position and have left four brackets in position 8 and 11 have the right brackets. A position on the left with brackets of 11 positions in brackets right match; Location four brackets on the left and the location of eight brackets right match. The expression (x y)* z) (location eight brackets on the right side can not match left in brackets, location nine left in bracket
Platform: | Size: 1024 | Author: 林天 | Hits:

[Other匈牙利算法

Description: 本文用C语言实现了优化算法-匈牙利算法,以用来解决匹配问题-Using C programming language, the optimization algorithm-Hungary algorithm used to solve the matching problem
Platform: | Size: 3072 | Author: 申辉 | Hits:

[Special Effectscopap

Description: Matlab demo code for the cyclic order preserving assignment problem with application to shape matching-Matlab demo code for the cyclic order prese rving assignment problem with application to s CPR matching
Platform: | Size: 36864 | Author: Zhenhua | Hits:

[Graph programZSAD

Description: 区域法立体匹配的实时性问题研究 立体视觉匹配的相关算法-regional law stereo matching the real-time study of the problem of three-dimensional visual matching algorithms
Platform: | Size: 1024 | Author: 林雨 | Hits:

[Data structsCommonDivisor

Description: 这是一个二分图完全匹配问题, 题意:给出一组数,这组数按给出的序列从标号1依次递增编号,现在要求你编写一个程序改变这些数的序列,使得每个数和其下标的最大公约数和相加得到的数最小。-This is a complete bipartite graph matching problem, meaning title: In this paper, a group of a few, this group is given the serial number by one from the label followed by incremental number, and now ask you to prepare a program to change these number sequences, making each number and under the common denominator and the sum has been the subject of a number of the smallest.
Platform: | Size: 1024 | Author: 常雅敏 | Hits:

[Windows Develop0000002

Description: 利用循环队列模拟舞伴配对问题:在舞会上,男、女各自排成一队。舞会开始时。依次从男队和女队的队头各出一人配成舞伴。如果两队初始人数不等,则较长的那一队中未配对者等待下一轮舞曲。 -Circular Queue using simulated partner matching problem: at the ball, men
Platform: | Size: 1024 | Author: 石狼 | Hits:

[Data structssuit_list

Description: 利用堆栈解决括号的匹配问题 括号的匹配问题-Use the stack to resolve the issue of matching brackets brackets matching problem
Platform: | Size: 1024 | Author: ivan | Hits:

[Data structshuotree

Description: 括号匹配问题和建立二叉树问题,都是C语言的源代码.-Parentheses matching problem and the establishment of tree problems, are C language source code.
Platform: | Size: 19456 | Author: huang | Hits:

[Mathimatics-Numerical algorithmscdmspp

Description: 串的模式匹配问题算法cpp源代码,(查找子串在主串中的位置)。ACM适用-String pattern matching problem algorithm cpp source code, (substring search in the main string of the position). ACM applicable
Platform: | Size: 1024 | Author: | Hits:

[assembly languagefind

Description: 本程序用汇编16位语言实现字符串匹配的问题。很好的解决了这一类似的问题。-This procedure used to compile 16 Language string matching problem. Well solve the similar problems.
Platform: | Size: 1024 | Author: muse | Hits:

[Industry research123

Description: 一种基于方向信息的鲁棒型Hausdorff距离匹配方法。该方法采用方向信息提取图 像边缘,通过计算边缘匹配率( edge matching rate, EMR)获得候选匹配区域,然后采用修正后的Hausdorff距离构造 相似性测度。实验结果表明,该方法加快了匹配过程,提高了抗噪性能,并能够准确匹配含有遮挡和伪边缘点的图 像,从而解决了基于传统Hausdorff距离匹配方法因噪声点、伪边缘点和出格点而造成的误匹配问题。-Based on the direction of information Robust Hausdorff distance matching method. Methods The direction of the image edge information extraction, matching the rate by calculating the edge (edge matching rate, EMR) access to the candidate matching area, and then adopt a revised structure Hausdorff distance similarity measure. Experimental results show that the method to accelerate the matching process and enhance the anti-noise performance and the ability to accurately match the containing block and pseudo-edge image, so as to solve the Hausdorff distance based on the traditional matching method because of the noise, the pseudo-edge point and the far point matching problem caused by misuse.
Platform: | Size: 1140736 | Author: 南飞燕 | Hits:

[OtherZUKANGPIPEI

Description: 阻抗附件.PDF详细介绍电路设计过程中的阻抗匹配问题-Impedance annex. PDF details on the process of circuit design impedance matching problem
Platform: | Size: 4003840 | Author: ryc | Hits:

[Windows DevelopExpressionProblemOfComputing

Description: 本程序解决表达式的运算问题,包括常规的数学运算和闲逛匹配问题-This procedure to solve the expression problem of computing, including the conventional arithmetic and around matching problem
Platform: | Size: 2048 | Author: fly | Hits:

[File FormatMatchingEulertoursandtheChinesepostman

Description: Matching, Euler tours and the Chinese postman.pdf是Edmonds和Johnson1973年,通过使用匹配理论,首次给出中国邮递员问题的多项式时间解法,前无古人,后无需来者。-The solution of the Chinese postman problem using matching theory is given
Platform: | Size: 1734656 | Author: abrahamlau | Hits:
« 1 23 4 5 6 7 8 9 10 ... 16 »

CodeBus www.codebus.net